Redundancy in logic I: CNF propositional formulae
نویسندگان
چکیده
منابع مشابه
Redundancy in Logic I: CNF Propositional Formulae
A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant equivalent subset (I.E.S.) We study the co...
متن کاملThe Complexity of Checking Redundancy of CNF Propositional Formulae
A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant equivalent subset (I.E.S.) We study the co...
متن کاملRedundancy in Logic II: 2CNF and Horn Propositional Formulae
We report complexity results about redundancy of formulae in 2CNF form. We first consider the problem of checking redundancy and show some algorithms that are slightly better than the trivial one. We then analyze problems related to finding irredundant equivalent subsets (i.e.s.) of a given set. The concept of cyclicity proved to be relevant to the complexity of these problems. Some results abo...
متن کاملMining to Compact CNF Propositional Formulae
In this paper, we propose a first application of data mining techniques to propositional satisfiability. Our proposed Mining4SAT approach aims to discover and to exploit hidden structural knowledge for reducing the size of propositional formulae in conjunctive normal form (CNF). Mining4SAT combines both frequent itemset mining techniques and Tseitin’s encoding for a compact representation of CN...
متن کاملGeneralizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality
Detection and elimination of redundant clauses from propositional formulas in Conjunctive Normal Form (CNF) is a fundamental problem with numerous application domains, including AI, and has been the subject of extensive research. Moreover, a number of recent applications motivated various extensions of this problem. For example, unsatisfiable formulas partitioned into disjoint subsets of clause...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2005
ISSN: 0004-3702
DOI: 10.1016/j.artint.2004.11.002